On rational limits of Shelah - Spencer graphs
نویسندگان
چکیده
Given a sequence {αn} in (0, 1) converging to a rational, we examine the model theoretic properties of structures obtained as limits of ShelahSpencer graphs G(m,m−αn ). We show that in most cases the model theory is either extremely well-behaved or extremely wild, and characterize when each
منابع مشابه
A simpler axiomatization of the Shelah-Spencer almost sure theories
We give an explicit AE-axiomatization of the almost sure theories of sparse random graphs G(n, n−α) of Shelah-Spencer. In the process we give a method of constructing extensions of graphs whose ‘relative dimension’ is negative, but arbitrarily small. We describe the existentially closed and locally finite models of the theory and produce types of dimension zero. We offer a useful characterizati...
متن کاملDOP and FCP in Generic Structures
We work throughout in a finite relational language L. This paper is built on [2] and [3]. We repeat some of the basic notions and results from these papers for the convenience of the reader but familiarity with the setup in the first few sections of [3] is needed to read this paper. Spencer and Shelah [6] constructed for each irrational α between 0 and 1 the theory T α as the almost sure theory...
متن کاملCovering Numbers Associated with Trees Branching into a Countably Generated Set of Possibilities
The notion of an A-nowhere dense set for various subsets A of the reals may prove to be of interest in its own right, but this paper will be concerned exclusively with the special case A = Q. Notice that rational perfect sets introduced by Miller in [1] form a subset of the Q-nowhere dense sets since the closure of a set is rational perfect if it is perfect and disjoint from the rationals. On t...
متن کامل- Universal Finite Graphs
This paper investigates the class of k-universal finite graphs, a local analog of the class of universal graphs, which arises naturally in the study of finite variable logics. The main results of the paper, which are due to Shelah, establish that the class of k-universal graphs is not definable by an infinite disjunction of first-order existential sentences with a finite number of variables and...
متن کاملK-universal Finite Graphs
This paper investigates the class of k universal nite graphs a local analog of the class of universal graphs which arises naturally in the study of nite variable logics The main results of the paper which are due to Shelah establish that the class of k universal graphs is not de nable by an in nite disjunction of rst order existential sentences with a nite number of variables and that there exi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 77 شماره
صفحات -
تاریخ انتشار 2012